An explicit construction of type A Demazure atoms

نویسنده

  • S. Mason
چکیده

Demazure characters of type A, which are equivalent to key polynomials, have been decomposed by Lascoux and Schützenberger into standard bases. We prove that the resulting polynomials, which we call Demazure atoms, can be obtained from a certain specialization of nonsymmetric Macdonald polynomials. This combinatorial interpretation for Demazure atoms accelerates the computation of the right key associated to a semi-standard Young tableau. Utilizing a related construction, we provide a new combinatorial description of the key polynomials.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refinements of the Littlewood-Richardson Rule

In the prequel to this paper [5], we showed how results of Mason [11], [12] involving a new combinatorial formula for polynomials that are now known as Demazure atoms (characters of quotients of Demazure modules, called standard bases by Lascoux and Schützenberger [6]) could be used to define a new basis for the ring of quasisymmetric functions we call “Quasisymmetric Schur functions” (QS funct...

متن کامل

An analogue of the Robinson-Schensted-Knuth correspondence and non-symmetric Cauchy kernels for truncated staircases

We prove a restriction of an analogue of the Robinson-Schensted-Knuth correspondence for semi-skyline augmented fillings, due to Mason, to multisets of cells of a staircase possibly truncated by a smaller staircase at the upper left end corner, or at the bottom right end corner. The restriction to be imposed on the pairs of semi-skyline augmented fillings is that the pair of shapes, rearrangeme...

متن کامل

Anna Pun Drexel University “ On Decomposition of the Product of Demazure Atom and Demazure Characters ”

It is an open problem to prove the Schubert positivity property combinatorially. Recently Haglund, Mason, Remmel, van Willigenburg et al. have studied the skyline fillings (a tableau-combinatorial object giving a combinatorial description to nonsymmetric MacDonald polynomials , proved by Haglund, Haiman and Loehr) specifically for the case of Demazure atoms (atoms) and key polynomials (keys). T...

متن کامل

Properties of the nonsymmetric Robinson-Schensted-Knuth algorithm

We introduce a generalization of the Robinson-Schensted-Knuth algorithm to composition tableaux involving an arbitrary permutation. If the permutation is the identity our construction reduces to Mason’s original composition Robinson-Schensted-Knuth algorithm. In particular we develop an analogue of Schensted insertion in our more general setting, and use this to obtain new decompositions of the...

متن کامل

Demazure Atoms

Demazure characters can be decomposed into smaller pieces, called standard bases by Lascoux and Schützenberger. We prove that these polynomials, which we call Demazure atoms, are the same polynomials obtained from a certain specialization of nonsymmetric Macdonald polynomials. This combinatorial interpretation for Demazure atoms accelerates the computation of the key associated to a given semi-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009